A GGQS-based hybrid algorithm for inter-cloud time-critical event dissemination

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Hybrid Meta-Heuristic Algorithm based on Imperialist Competition Algorithm

The human has always been to find the best in all things. This Perfectionism has led to the creation of optimization methods. The goal of optimization is to determine the variables and find the best acceptable answer Due to the limitations of the problem, So that the objective function is minimum or maximum. One of the ways inaccurate optimization is meta-heuristics so that Inspired by nature, ...

متن کامل

Monitoring Travel Time Reliability from the Cloud: Cloud Computing Based Architecture for Advanced Traffic Information Dissemination

Under the existing loosely-distributed sensoring environment with heterogeneous data sources, transportation planning and management agencies have found a critical need for efficiently storing, processing and extracting desirable corridor-level and network-level information through a systematic and seamless integration of data sources. Extracting travel time variability and trip reliability inf...

متن کامل

A Bayesian Algorithm for Image-Based Time-to-Event Prediction

This paper presents a novel Bayesian algorithm for making image-based predictions of the timing of a clinical event, such as the diagnosis of disease or death. We build on the Relevance Voxel Machine (RVoxM) framework, a Bayesian multivariate prediction model that exploits the spatial smoothness in images and has been demonstrated to offer excellent predictive accuracy for clinical variables. W...

متن کامل

A Hybrid Genetic Algorithm for the Open Shop Scheduling with Makespan and Total Completion Time

Proper scheduling of tasks leads to optimum using of time and resources, in order to obtaining best result. One of the most important and complicated scheduling problems is open shop scheduling problem. There are n jobs in open shop scheduling problem which should be processed by m machines. Purpose of scheduling open shop problem is attaining to a suitable order of processing jobs by specified...

متن کامل

A Hybrid Genetic Algorithm for the Open Shop Scheduling with Makespan and Total Completion Time

Proper scheduling of tasks leads to optimum using of time and resources, in order to obtaining best result. One of the most important and complicated scheduling problems is open shop scheduling problem. There are n jobs in open shop scheduling problem which should be processed by m machines. Purpose of scheduling open shop problem is attaining to a suitable order of processing jobs by specified...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of the Korean Data and Information Science Society

سال: 2012

ISSN: 1598-9402

DOI: 10.7465/jkdi.2012.23.6.1259